An explicit solution for a tandem queue with retrials and losses
نویسندگان
چکیده
منابع مشابه
An explicit solution for a tandem queue with retrials and losses
We consider a retrial tandem queueing system with two servers whose service times follow two exponential distributions. There are two types of customers: type one and type two. Customers of type one arrive at the first server according to a Poisson process. An arriving customer of type one that finds the first server busy joins an orbit and retries to enter the server after some time. We assume...
متن کاملThe Israeli queue with retrials
The so-called “Israeli queue” (Boxma et al. in Stoch Model 24(4):604– 625, 2008; Perel and Yechiali in Probab Eng Inf Sci, 2013; Perel and Yechiali in Stoch Model 29(3):353–379, 2013) is a multi-queue polling-type system with a single server. Service is given in batches, where the batch sizes are unlimited and the service time of a batch does not depend on its size. After completing service, th...
متن کاملMultiserver Queueing Systems with Retrials and Losses
The interest in retrial queueing systems mainly lies in their application to telephone systems. This paper studies multiserver retrial queueing systems with n servers. The arrival process is a quite general point process. An arriving customer occupies one of the free servers. If upon arrival all servers are busy, then the customer waits for his service in orbit, and after a random time retries ...
متن کاملQueues in tandem with customer deadlines and retrials
We study queues in tandem with customer deadlines and retrials. We first consider a 2-queue Markovian system with blocking at the second queue, analyze it, and derive its stability condition. We then study a non-Markovian setting and derive the stability condition for an approximating diffusion, showing its similarity to the former condition. In the Markovian setting, we use probability generat...
متن کاملAn Explicit Solution for the Value Function of a Priority Queue
We consider a multiclass preemptive-resume priority queue with Poisson arrivals and general service times. We derive explicit expressions for the discounted expected and long-run average weighted queue lengths and switching costs, the latter one only in the case of exponential service times. We illustrate our results with numerical calculations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operational Research
سال: 2011
ISSN: 1109-2858,1866-1505
DOI: 10.1007/s12351-011-0113-7